An affine eigenvalue problem on the nonnegative orthant
نویسندگان
چکیده
In this paper, we consider the conditional affine eigenvalue problem λx = Ax + b, λ ∈ R, x ≥ 0, ‖x‖ = 1, where A is an n × n nonnegative matrix, b a nonnegative vector, and ‖·‖ a vector norm. Under suitable hypotheses, we prove the existence and uniqueness of the solution (λ∗, x∗) and give its expression as the Perron root and vector of a matrix A + bc∗ , where c∗ has a maximizing property depending on the considered norm. The equation x = (Ax+ b)/‖Ax+ b‖ has then a unique nonnegative solution, given by the unique Perron vector of A + bc∗ .
منابع مشابه
On the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملA nonsmooth algorithm for cone-constrained eigenvalue problems
Such an eigenvalue problem arises in mechanics and in other areas of applied mathematics. The symbol K refers to a closed convex cone in the Euclidean space R and (A,B) is a pair of possibly asymmetric matrices of order n. Special attention is paid to the case in which K is the nonnegative orthant of R. The more general case of a possibly unpointed polyhedral convex cone is also discussed in de...
متن کاملOn Reformulations of Nonconvex Quadratic Programs over Convex Cones by Set-semidefinite Constraints
The well-known result stating that any non-convex quadratic problem over the nonnegative orthant with some additional linear and binary constraints can be rewritten as linear problem over the cone of completely positive matrices (Burer, 2009) is generalized by replacing the nonnegative orthant with an arbitrary closed convex cone. This set-semidefinite representation result implies new semidefi...
متن کاملMoment Approximations for Set-Semidefinite Polynomials
The set of polynomials which are nonnegative over a subset of the nonnegative orthant (we call them set semidefinite) have many uses in optimization. A common example of this type of set is the set of copositive matrices, where effectively we are considering nonnegativity over the entire nonnegative orthant and we limit the polynomials to be homogeneous of degree two. Lasserre in A new look at ...
متن کاملNumerical Methods for Solving Inverse Eigenvalue Problems for Nonnegative Matrices
Presented are two related numerical methods, one for the inverse eigenvalue problem for nonnegative or stochastic matrices and another for the inverse eigenvalue problem for symmetric nonnegative matrices. The methods are iterative in nature and utilize alternating projection ideas. For the symmetric problem, the main computational component of each iteration is an eigenvalue-eigenvector decomp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005